Efficient global optimization of constrained mixed variable problems
نویسندگان
چکیده
منابع مشابه
Filter Pattern Search Algorithms for Mixed Variable Constrained Optimization Problems
A new class of algorithms for solving nonlinearly constrained mixed variable optimization problems is presented. This class combines and extends the Audet-Dennis Generalized Pattern Search (GPS) algorithms for bound constrained mixed variable optimization, and their GPS-filter algorithms for general nonlinear constraints. In generalizing existing algorithms, new theoretical convergence results ...
متن کاملA Particle Swarm Optimization Algorithm for Mixed-Variable Nonlinear Problems
Many engineering design problems involve a combination of both continuous anddiscrete variables. However, the number of studies scarcely exceeds a few on mixed-variableproblems. In this research Particle Swarm Optimization (PSO) algorithm is employed to solve mixedvariablenonlinear problems. PSO is an efficient method of dealing with nonlinear and non-convexoptimization problems. In this paper,...
متن کاملMultiobjective Optimization of Mixed Variable Design Problems
In this paper, a new multiobjective genetic algorithm is employed to support the design of a hydraulic actuation system. First, the proposed method is tested using benchmarks problems gathered from the literature. The method performs well and it is capable of identifying multiple Pareto frontiers in multimodal function spaces. Secondly, the method is applied to a mixed variable design problem w...
متن کاملGlobal optimization of robust chance constrained problems
We propose a stochastic algorithm for the global optimization of chance constrained problems. We assume that the probability measure with which the constraints are evaluated is known only through its moments. The algorithm proceeds in two phases. In the first phase the probability distribution is (coarsely) discretized and solved to global optimality using a stochastic algorithm. We only assume...
متن کاملTopographical Global Optimization for Constrained Problems
In topographical global optimization a sample of points that superuniformly cover the region of interest, A, is used in combination with the function evaluations in these points to obtain a topographical graph of A from which candidate points are easily extracted for local minimizations. This paper discusses some of the problems in obtaining such a cover and presents some solutions. These solut...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Global Optimization
سال: 2018
ISSN: 0925-5001,1573-2916
DOI: 10.1007/s10898-018-0715-1